Hierarchies and Space Measures for Pointer Machines

نویسندگان

  • David R. Luginbuhl
  • Michael C. Loui
چکیده

We establish several time and space results for Schonhage’s pointer machine (P M ), including space compression, time hierarchy, and space hierarchy. We also present two definitions of space complexity for PMs, and we consider how each space measure affects the equivalence of PMs to the more classical models of computation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotonic use of space and computational complexity over abstract structures

We use relational pointer machines as a framework for generalized computational complexity. Non-reuse of memory space, dubbed monotonic computing, is proposed as a fundamental concept that threads together various abstract generalizations of PTime. Depending on the use of space, relational machines generalize DLogSpace, PTime, NPTime and PSpace, We show that alternating first order machines are...

متن کامل

Hierarchical Pointer Analysis for Distributed Programs

We present a new pointer analysis for use in shared memory programs running on hierarchical parallel machines. The analysis is motivated by the partitioned global address space languages, in which programmers have control over data layout and threads and can directly read and write to memory associated with other threads. Titanium, UPC, Co-Array Fortran, X10, Chapel, and Fortress are all exampl...

متن کامل

Unification and Logarithmic Space

We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is inspired from proof theory and more specifically linear logic and Geometry of Interaction. We show how unification can be used to build a model of computation by means of specific su...

متن کامل

Pointer Machines and Pointer Algorithms: an Annotated Bibliography

The term pointer machine has been used ambiguously in Computer Science literature. In this report we give precise deenitions of several models that have been referred to as \pointer machines" and list references for each of these models under the appropriate heading.

متن کامل

Hierarchies of Modal and Temporal

We introduce and study hierarchies of extensions of the propositional modal and temporal languages with pairs of new syntactic devices: "point of reference | reference pointer" which enable semantic references to be made within a formula. We propose three diierent but equivalent semantics for the extended languages, discuss and compare their expressiveness. The languages with reference pointers...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Comput.

دوره 104  شماره 

صفحات  -

تاریخ انتشار 1993